Channel-aware caching-aided coded multicast

ABSTRACT

In one aspect, a network element for a wireless Content Delivery Network is provided. The network element receives requests from receiver devices for a video segment over the wireless CDN, and computes a number of descriptors (representing quality) of the requested video segment, where the number of descriptors is determined for each receiver device based on channel conditions between the network element and the receiver devices. The network element clusters a set of descriptors for each receiver device into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors and the channel conditions between the network element and the receiver devices, and generates a multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs. The network element transmits the multicast codeword to each of the receiver devices in response to the received requests.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to commonly assigned, co-pending U.S. application Ser. No. 14/514,938 filed Oct. 15, 2014, and also to commonly assigned, co-pending U.S. application Ser. No. 14/514,905 filed Oct. 15, 2014 the entire contents of both of which are incorporated herein by reference.

BACKGROUND

Content distribution networks (CDNs) face capacity and efficiency issues associated with the increase in popularity of on-demand audio/video streaming. Future Internet usage is expected to include a rich variety of online multimedia services accessed from an ever growing number of multimedia capable mobile devices. As such, CDN providers are challenged to provide solutions that can deliver bandwidth-intensive, delay-sensitive, on-demand video-based services over increasingly crowded, bandwidth-limited wireless access networks. One major cause for the bandwidth stress facing wireless network operators is the difficulty to exploit the multicast nature of the wireless medium when wireless users or access points do not experience the same channel conditions or access the same content at the same time.

BRIEF SUMMARY

In one embodiment a network element (sender) for a wireless Content Delivery Network is provided that is configured to receive a request from receiver devices for a video segment over the wireless CDN. The network element computes a number of descriptors of the video segment scheduled to be delivered to each receiver device, where the number of descriptors is determined for each receiver device based on channel conditions between the network element and the respective receiver devices. The network element clusters a set of descriptors for each receiver device into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors and the channel conditions between the network element and the receiver devices, and generates a multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs. The generated multicast codeword is transmitted from the network element to each of the receiver devices in response to the received request.

In one embodiment the network element determines the clustered set of descriptors scheduled for each receiver device and the minimum number of Generalized Independent Sets (GISs) based on cached content at each of the receivers.

In one embodiment the network element generates the multicast codeword such that each receiver device is enabled to decode its requested video segment at a rate that is equal to the maximum rate achievable based on the channel conditions.

In one embodiment the network element generates the multicast codeword as a fixed length codeword.

In one embodiment the network element clusters the set of descriptors scheduled for each receiver device into a minimum number of Generalized Independent Sets (GISs) such that descriptors in a given GIS that are scheduled for different receiver devices can be transmitted in a same time-frequency slot without affecting decodability of the multicast codeword at the receiver devices.

In one embodiment the network element determines the minimum number of Generalized Independent Sets (GISs) as a determined channel-aware chromatic-number of GISs that cover a conflict graph.

In one embodiment the network element encodes the clustered descriptors scheduled for each receiver device into fixed-length channel codewords for each receiver based on channel conditions between the network element and each receiver device and combines the fixed-length channel codewords into the multicast codeword.

In one embodiment the network element determines the fixed-length channel codewords for each receiver device using a channel codebook that is determined based on the channel conditions between the network element and each receiver device.

In one embodiment the network element transmits the channel codebook to each of receiver devices.

In one embodiment the network element generates the multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs determined via a Channel-Aware Chromatic Index Coding (CA-CIC) algorithm.

In one embodiment the network element generates the multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs determined via a Channel-Aware Hierarchical greedy Coloring (CA-HgC) algorithm.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example embodiment of a content distribution network.

FIG. 2 illustrates an example structure of a network element.

FIG. 3 illustrates a block diagram representation of components of the network element during the delivery phase.

FIG. 4 illustrates an example process flow diagram describing the operation of the delivery phase as implemented by the components of FIG. 3.

FIG. 5 illustrates an example of a U-clustered conflict graph

_(M,W) for three receivers.

FIG. 6 illustrates an example of an (s₁, s₂, s₃)-GISs determined based on the 3-clustered graph

_(M,W) shown in FIG. 5.

FIG. 7 is an example of an algorithm in accordance with an aspect of the disclosure.

FIG. 8 is an example of another algorithm in accordance with an aspect of the disclosure.

DETAILED DESCRIPTION

Various aspects of the disclosure are described below with reference to the accompanying drawings, in which like numbers refer to like elements throughout the description of the figures. The description and drawings merely illustrate the principles of the disclosure. It will be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles and are included within spirit and scope of the disclosure.

As used herein, the term, “or” refers to a non-exclusive or, unless otherwise indicated (e.g., “or else” or “or in the alternative”). Furthermore, as used herein, words used to describe a relationship between elements should be broadly construed to include a direct relationship or the presence of intervening elements unless otherwise indicated. For example, when an element is referred to as being “connected” or “coupled” to another element, the element may be directly connected or coupled to the other element or intervening elements may be present. In contrast, when an element is referred to as being “directly connected” or “directly coupled” to another element, there are no intervening elements present. Similarly, words such as “between”, “adjacent”, and the like should be interpreted in a like fashion.

In the following description, illustrative embodiments will be described with reference to acts and symbolic representations of operations (e.g., in the form of flow charts, flow diagrams, data flow diagrams, structure diagrams, block diagrams, etc.) that may be implemented as program modules or functional processes include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types and may be implemented using existing hardware at existing network elements (e.g., base stations, base station controllers, NodeBs eNodeBs, etc.). Such existing hardware may include one or more Central Processors (CPUs), digital signal processors (DSPs), application-specific-integrated-circuits, field programmable gate arrays (FPGAs) computers or the like.

Although a flow chart may describe the operations as a sequential process, many of the operations may be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. A process may be terminated when its operations are completed, but may also have additional steps not included in the figure. A process may correspond to a method, function, procedure, subroutine, subprogram, etc. When a process corresponds to a function, its termination may correspond to a return of the function to the calling function or the main function.

As disclosed herein, the term “storage medium” or “computer readable storage medium” may represent one or more devices for storing data, including read only memory (ROM), random access memory (RAM), magnetic RAM, core memory, magnetic disk storage mediums, optical storage mediums, flash memory devices and/or other tangible machine readable mediums for storing information. The term “computer-readable medium” may include, but is not limited to, portable or fixed storage devices, optical storage devices, and various other mediums capable of storing, containing or carrying instruction(s) and/or data.

Furthermore, example embodiments may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine or computer readable medium such as a computer readable storage medium. When implemented in software, a special purpose processor or special purpose processors will perform the necessary tasks.

A code segment may represent a procedure, function, subprogram, program, routine, subroutine, module, software package, class, or any combination of instructions, data structures or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.

The present disclosure is directed towards a wireless video delivery paradigm based on the use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled access points that may be requesting different content and experiencing different channel conditions. The present disclosure addresses the caching-aided coded multicast problem as a joint source-channel coding problem and describes a framework that preserves the cache-enabled multiplicative throughput gains of the error-free scenario, while ensuring independent maximum per-receiver (access point) channel rates, unaffected by the presence of receivers with worse channel conditions.

Some of the notable aspects of the present disclosure described in detail below include 1) an information theoretic framework for wireless video distribution that takes into account the specific characteristics of the wireless propagation channel (i.e., channel rates) in the presence of any combination of unicast/multicast transmission and wireless edge caching. 2) A channel-aware caching-aided coded multicast video delivery scheme, referred to herein as Random Popularity based caching and Channel-Aware Chromatic-number Index Coding (RAP-CA-CIC), which provides for the highest admissible video throughput to each receiver (helper) for the given propagation conditions, i.e., avoiding throughput penalizations from the presence of receivers experiencing worse propagation conditions. 3) A novel polynomial-time approximation of RAP-CA-CIC, referred to as Random Popularity based caching and Hierarchical greedy Channel Aware Coloring (RAP-CA-HgC) with running time at most cubic in the number of receivers and quadratic in the number of (per-receiver) requested video descriptions.

As shown in FIG. 1, a Content Distribution Network (CDN) in accordance with various aspects of the disclosure may include a network element 151 (“sender node”) wirelessly connected to a plurality U of destination or receiver nodes 200 (“helper devices”), where ∪={1, . . . , U}. The network element 151 may be a content source (e.g., a multicast source base station) for distributing data files (e.g., movie files). The destination devices 200 may be cache-enabled small cell base stations, access points, or end user devices requesting data from the content source. Each destination or receiver device 200 may be part of or associated with a device that allows for an end user to access the requested data. For example, each destination device 200 may be an access point, a set top box, a personal computer, a tablet, a mobile phone, or any other device associated used for streaming audio and video. Each of the destination devices 200 may include a memory for storing data received from the network element 151. The structure and operation of the network element 151 and destination devices 200 will be described in more detail below with reference to FIGS. 2 and 3.

The wireless links interconnecting the network element 151 to the receiver nodes 200 are assumed to be lossy links. Specifically, the lossy links between the sender and the receivers are assumed to be stochastically degraded binary broadcast channels (BC). While the binary field is particularly convenient for ease of presentation, the present disclosure is not limited to any particular model and can be extended to general stochastically degraded broadcast channels, with the case of arbitrary additive noise broadcast channels being particularly immediate. The channel noise analysis includes both a binary symmetric broadcast channel (BS-BC) and a binary erasure broadcast channel (BE-BC).

BS-BC Case:

The channel output Y_(u)[t] observed by the u-th receiver at the t-th channel use takes values in the binary alphabet Y≡{0,1} and is given by Y _(u) [t]=X[t]+Z _(u) [t],

where X[t] denotes the binary encoded symbol sent by the sender at the t-th channel use, and Z_(u)[t] denotes the additive noise of the channel corresponding to receiver u, modeled as a Bernoullian variable with parameter given by the channel degradation ε_(u), i.e., Z[t]:B(ε_(u)). Denoting the achievable channel rate as and denoting H(ε_(u)) as the binary entropy function the relationship may be defined as: η_(u)≤1−H(ε_(u)).

BE-BC Case:

The channel output Y_(u)[t] observed by the u-th receiver at the t-th channel use exactly reproduces the channel input X[t] with probability (1−ε_(u)) and otherwise indicates an erasure event, with probability ε_(u). In this case, Y_(u)[t] takes values in the binary alphabet Y≡{0,1,å} so that an erasure event is represented by the erasure symbol “å”. The achievable channel rate η_(u) then satisfies η_(u)≤1−ε_(u). Without loss of generality, it is assumed that 0≤ε₁≤ε₂≤ . . . ≤ε_(U)≤1.

FIG. 2 is a diagram illustrating an example structure of network element 151. According to at least one example embodiment, the network element 151 may be configured for use in a communications network (e.g., the content distribution network (CDN) of FIG. 1). As shown in the example of FIG. 2, the network element 151 may include a data bus 159, a transmitter 152, a receiver 154, a memory 156, and a processor 158. Although a separate description is not included here for the sake of brevity, it should be understood that each destination device 200 may have the same or similar structure as the network element 151.

The transmitter 152, receiver 154, memory 156, and processor 158 may send data to and/or receive data from one another using the data bus 159. The transmitter 152 is a device that includes hardware and any necessary software for transmitting wireless signals including, for example, data signals, control signals, and signal strength/quality information via one or more wireless connections to other network elements in a communications network.

The receiver 154 is a device that includes hardware and any necessary software for receiving wireless signals including, for example, data signals, control signals, and signal strength/quality information via one or more wireless connections to other network elements in a communications network.

The memory 156 may be any device capable of storing data including magnetic storage, flash storage, etc.

The processor 158 may be any device capable of processing data including, for example, a special purpose processor configured to carry out specific operations based on input data, or capable of executing instructions included in computer readable code. For example, it should be understood that the modifications and methods described below may be stored on the memory 156 and implemented by the processor 158 within network element 151.

It should be understood that the below modifications and methods may be carried out by one or more of the above described elements of the network element 151. For example, the receiver 154 may carry out steps of “receiving,” “acquiring,” and the like; transmitter 152 may carry out steps of “transmitting,” “outputting,” “sending” and the like; processor 158 may carry out steps of “determining,” “generating”, “correlating,” “calculating,” and the like; and memory 156 may carry out steps of “storing,” “saving,” and the like.

The present disclosure is described, without limitation, in the context of a video streaming application. It is accordingly assumed that the sender has access to a content library F={1, . . . , m} containing m files, where each file has entropy equal to F bits. Each receiver u∈∪ has a cache with storage capacity M_(u)F bits (i.e., M_(u) files). M_(u,f) denotes the fraction of file f∈F stored (cached) at receiver u, such that Σ_(f)M_(u,f)≤M_(u). Without loss of generality, the files are represented by binary vectors W_(f)∈₂ ^(F).

Each file f∈F represents a video segment, which is multiple description coded into D descriptions using, for example, one of conventional coding schemes. Each description is packaged into one information unit or packet for transmission. Each packet is represented as a binary vector of length (entropy) B=F/D bits. A low-quality version of the content can be reconstructed once a receiver is able to recover any description. The reconstruction quality improves by recovering additional descriptions and depends solely on the number of descriptions recovered, irrespective of the particular recovered collection. Hence, there are D video qualities per segment, where the entropy in bits of quality d∈{1, . . . , D}, containing d descriptions, is given by F_(d)=Bd. Note that in video streaming applications, each video segment typically has the same (playback) duration, which is denoted by Δ in time units (or channel uses) herein. Hence, the difference in quality levels solely depend on the number of bits F_(d).

Video segments are characterized by a popularity or demand distribution Q=[q_(f,u)], u=1, . . . , U, f=1, . . . , m, where q_(f,u)∈[0,1] and Σ_(f=1) ^(m)q_(f,u)=1 (e.g., receiver u requests file f with probability q_(f,u)). Without loss of generality up to index reordering, is is assumed q_(f,u) has non-increasing components q_(1,u)≥ . . . ≥q_(m,u). Let f_(u) denote the random request at receiver u. The realization of f_(u) is denoted by f_(u).

It is noted that the present disclosure is directed to a general video on-demand setting, in which receiver requests follow an arbitrary popularity distribution. As such, the demand message set cannot be represented as a degraded message set since a given receiver's demand is not necessarily a subset of another receiver's demand. The present disclosure includes and generalizes any combination of degraded message sets, via possible overlapping of receiver demands, and message cognition, via available cached or side information.

Various aspects are described in which the sender (e.g., network element 151) implements a video delivery system to receivers 200 in two phases: a caching (or placement) phase followed by a transmission (or delivery) phase. Prior to describing various aspects pertaining to the operations of the sender device in the transmission or delivery phase (the primary focus of the present disclosure), an overview of the operations of the sender device during the caching phase is described first for completeness.

Caching Phase

The caching phase occurs during a period of low network traffic. In this phase, using the knowledge of the demand distribution and the cache capacity constraints, the sender decides what content to (transmit and) store at each receiver. Because of the time-scale separation between caching and transmission phases, the caching phase is sometimes referred to as the placement or pre-fetching phase.

In one aspect, the sender may be configured to implement the caching phase using Algorithm 1 below, where each data file ‘f’ that belongs to the library ‘F’ is divided into ‘B’ equal-size packets, represented as symbols of a finite field:

Algorithm 1: Caching algorithm 1 for f ∈ F → 2 Each user u caches a subset of p_(u,f)M_(u)B distinct packets of file f uniformly at random; 3 endfor 4 M = {M_(u,f), with u = 1,...,n,and f = 1,...,m}; 5 return(M); end Caching algorithm

During the caching phase, the network element 151 exploits the fact that a video segment is multiple description coded into D descriptions, each of length B=F/D bits. In the following, such descriptions are referred to as packets and denoted by {W_(f,l):l=1, . . . , D}. At the beginning of time, a realization of the library {W_(f)} is revealed to the sender. The sender fills the caches of each of the U receivers through a set of U encoding functions {Z_(u)}, such that Z_(u)({W_(f)}) denotes the codeword stored in the cache of receiver u.

Thus, caching phase as implemented by the network element works as follows. Each receiver, instructed by the sender, randomly selects and stores in its cache a collection of p_(f,u)M_(u)D distinct packets of file f∈F received from the sender, where p_(u)=(p_(l,u), . . . , p_(m,u)) is a vector with components 0≤p_(f,u)≤1/M_(u), ∀f, such that Σ_(f=1) ^(m)p_(f,u)=1, referred to as the caching distribution of receiver u. Hence, the arbitrary element p_(f,u) of p_(u) represents the fraction of the memory M_(u) allocated to file f. The resulting codeword Z_(u)({W_(f)}) transmitted by the sender and stored in the cache of receiver u is given by:

Z_(u) = (W_(1, ℓ_(1, 1)^(u)), …  , W_(1, ℓ_(1, p_(1, u)M_(u)D)^(u)), W_(2, ℓ_(2, 1)^(u)),    …  , W_(2, ℓ_(1, p_(2, u)M_(u)D)^(u)), …  , W_(m, ℓ_(m, 1)^(u)), …  , W_(m, ℓ_(m, p_(m, u)M_(u)D)^(u)))

Where, l_(f,i) ^(u) is the index of the i-th packet of file f cached by receiver u. The tuples of indices (l^(u) _(f,1), . . . , l^(u) _(f,p) _(f,u) _(M) _(u) _(D)) are chosen independently across for each receiver u∈∪ and file f∈F, with uniform probability over all

$\quad\begin{pmatrix} D \\ {p_{f,u}M_{u}D} \end{pmatrix}$ distinct subsets of size p_(f,u)M_(u)D in the set of D packets of file f. The random collection of cached packet indices across all receivers are referred to as the cache configuration, denoted by ={Z_(u)}. A given realization of M the cached information is denoted by M.

Moreover, M_(u,f) denotes the vector of indices of the packets of file f cached by receiver u. The caching policy described above is referred to as RAndom fractional Popularity-based (RAP) caching, which is completely characterized by the caching distribution P={p_(u)}, and is illustrated as Algorithm 1 implemented by the network element 151.

A notable property of RAP as described above of choosing the identity of the packets to be cached uniformly at random is that it increases the number of distinct packets cached across the network. That the receivers 200 thus cache different packets of the same file results in higher efficiciencies in terms of coded multicast opportunities during the transmission phase that are described below. This is one of the reasons why multiple description coding may be considered more suitable than scalable video coding, since randomly cached packets (descriptions) can then be used for decoding higher quality video versions. In contrast, with scalable video coding, randomly cached descriptions may be wasted if not all previous descriptions are delivered during the transmission phase. While such wastage could be avoided by only caching descriptions up to the maximum number that can be delivered to a given receiver, this is not a good solution because it creates another problem that there is too much overlap in cached information, which in turn reduces coded multicast opportunities during the delivery phase. In addition, any deviation due to imperfect knowledge of demand and channel conditions can again lead to wasted cached information, reducing system robustness.

Transmission Phase

After the caching phase, and in the transmission (or delivery) phase (the primary focus of the present disclosure), the network is repeatedly used in a time slotted fashion with time-slot duration Δ time units, given by the video streaming application. It is assumed that each receiver requests one video segment per time-slot from the sender. Based on the receiver requests, the stored contents at the receiver caches, and the channel conditions, the sender decides at what quality level to send the requested files (i.e., how many descriptions to send to each receiver), encodes the chosen video segments into a codeword, and sends it over the broadcast channel to the receivers, such that every receiver decodes the requested segment (at the corresponding quality level) within Δ time units. The scheduled quality level for receiver u is denoted by d_(u).

Thus, given the video segment playback duration Δ, the sender during the transmission or delivery phase is configured to use the knowledge about the cache contents {Z_(u)} that are already cached at the receivers 200, the channel conditions {ε_(u)} between the sender and the respective receivers 200, and the receiver requests f, schedules the appropriate quality level d_(u) for each requested video segment through a multicast encoder. The multicast encoder is implemented using a variable-to-fixed encoding function where X denotes the transmitted codeword as: X=X({Z _(u)},{ε_(u) },f).

Here, X is a binary sequences of finite length Δ, f=[f₁, f₂, . . . , f_(U)], with f_(j)∈F, denotes realization of the receiver random request vector f=[f₁, f₂, . . . , f_(U)].

FIG. 3 illustrates a block diagram example of a joint source-channel multicast encoder 300 (or multicast encoder 300) of the network element 151 for implementing the delivery phase. The goal of the multicast encoder 300 is to create a coded multicast codeword that allows each receiver 200 to decode its requested video segment at a rate that is equal to the maximum rate achievable if the remaining U−1 receivers had its same channel degradation. Referring to FIG. 3, the multicast encoder 300 of the network element 151 may include, for example, a scheduler 302, a channel-aware source compressor 304, and a concatenated source-channel encoder 306. The concatenated source-channel encoder may further include an outer channel encoder 308, and an inner source encoder 310. Although a particular set of components is illustrated, it will be understood that in various embodiments the blocks shown in FIG. 3 may be represented by a fewer or greater number of components without departing from the principles of the disclosure.

The operations each of the blocks illustrated in block diagram 300 of FIG. 3 are described in conjunction with the process flow diagram 400 of FIG. 4.

In step 402, the network element 151 receives a request for a video segment from receivers 200 during the delivery phase. Since the network element 151 has already performed the caching method described above, each destination device 200 may be assumed to have requested only those packets that were not cached (or stored) as a result of the caching method. Thus, the delivery phase consists of providing to each destination device 200 the missing part(s) of the requested files, i.e., the packets missing from that receiver devices' 200 memory.

In step 404, in response to receiving the requests from the receivers 200, the network element 151 (e.g., scheduler 302) computes the quality (i.e., the number of descriptors for the requested video segment) of the packets to be delivered to the receivers in response to the requests (step 404) based on the channel conditions between the sender and the respective receivers. Since for a given realization of the packet-level cache configuration and the channel rates {η_(u)}, the joint source-channel multicast encoder 300 is a variable-to-fixed encoder that, at each realization of the request vector f, encodes the scheduled descriptions for each receiver {d_(u)} into a multicast codeword X of fixed length Δ, in this step the scheduler 302 is configured to compute the number of descriptions (which represent quality as described above) scheduled for each requesting receiver u as:

${{d_{u}(f)} = \frac{\Delta\;\eta_{u}}{B\;{\psi\left( {f,M} \right)}}},$

where ψ(f,M) is a function of the packet-level cache realization M and of the request vector realization f, whose expression is given by:

${{\psi\left( {f,M} \right)} = {{\Sigma_{l = 1}^{u}\begin{pmatrix} U \\ l \end{pmatrix}}{\max_{f_{u} \in {f{(U^{l})}}}{\lambda\left( {f,l} \right)}}}},{and},{{\lambda\left( {f,l} \right)} = {\left( {p_{f}M} \right)^{l - 1}{\left( {1 - {p_{f}M}} \right)^{U - l + 1}.}}}$

The above computation of d_(u)(f) by scheduler 302 ensures that, for a codeword of length Δ, receiver u obtains d_(u) descriptions (each of size B) at a rate η_(u)/ψ(f,M), which is the maximum achievable rate when the remaining U−1 receivers have the same channel degradation η_(u).

In step 406, the network element 151 (e.g., channel aware source compressor 304) then clusters the set of packets (descriptions) scheduled for each receiver {d_(u)} into a determined minimized set of equivalent classes, each of which are referred to herein as the generalized independent set (GIS), which function is implemented by the channel-aware source compressor 304. In particular, the channel-aware source compressor 304 clusters the entire set of scheduled packets (descriptions) into the minimum number of GISs satisfying the following conditions: First, any two packets in a GIS scheduled for different receivers can be transmitted in the same time-frequency slot without affecting decodability; and second, the set of packets in a GIS scheduled for receiver u, denoted by P_(u), satisfies:

${\frac{P_{u}}{\eta_{u}} = \frac{P_{i}}{\eta_{i}}},{\forall u},{i \in \left\{ {1,\ldots\mspace{14mu},U} \right\}},$

to ensure that each receiver is scheduled a number of packets (descriptions) proportional to its channel rate (i.e., based on the channel conditions).

As described further below this minimization corresponds to a NP-hard optimization problem related to finding the minimum number of GISs that cover a properly constructed conflict graph. The minimum number of GISs that are determined by the channel-aware source compressor 304 to cover the conflict graph is referenced herein as the channel-aware chromatic-number, χ_(CA), which are then transmitted, to the receivers using one of two associated transmission schemes that are fully described, with examples, in the sections below.

In step 408, the network element 151 (e.g., the concatenated source-channel encoder 306 collectively) generates the multicast codeword X in which the scheduled descriptions {d_(u)} are encoded and transmits the multicast codeword to the receiver in response to the received request. In particular, the outer channel encoder 310 generates channel codewords of length n, while the inner source encoder 308 generates the final multicast codeword X of length Δ, by concatenating linear combinations of n-length channel codewords.

As shown in FIG. 3, for example, the concatenated source-channel encoder 306 takes {d_(u)} as input and generates a multicast codeword of length d_(u)Bψ(f,M)/η_(u). Hence, the dependence of ψ(f,M) on the demand realization f is important and may entail possible updates of the channel codebook at each request. In order to eliminate or at least mitigate this overhead, the multicast codeword length may be set, as an average, to be equal to the video segment playback duration Δ while maintaining that receiver u obtains d_(u) descriptions at an average channel rate η_(u)/E[ψ(f,M)]. In this case, the number of scheduled descriptions (in step 404) for receiver u may be implemented as:

${d_{u} = \frac{\Delta\;\eta_{u}}{{BE}\left\lbrack \;{\psi\left( {f,M} \right)} \right\rbrack}},$

where E[ψ(f,M)] is the expectation of ψ(f,M) taken over the random request vector f and random cache configuration given by: E[ψ(f,M)]=min{ϕ(p,Q), m }

and where:

${\overset{\_}{m} = {\sum\limits_{f = 1}^{m}\left( {1 - \left( {1 - q_{f}} \right)^{U}} \right)}},{{\phi\left( {p,Q} \right)} = {\sum\limits_{f = 1}^{m}{\sum\limits_{\ell = 1}^{U}{U_{\ell}{\rho_{f,\ell}\left( {1 - {p_{f}M}} \right)}^{U - \ell + 1}\left( {p_{f}M} \right)^{\ell - 1}}}}},{{\rho_{f,\ell}\left( {f = {\arg\;{\max\limits_{j \in \Upsilon}{\left( {p_{j}M} \right)^{\ell - 1}\left( {1 - {p_{f}M}} \right)^{n - \ell + 1}}}}} \right)};}$

in which Y denotes a random set of l elements selected in an i.i.d. manner from the set of files (with replacement).

More particularly, the outer channel encoder 308 illustrated in FIG. 3 takes as input the GISs generated by the channel-aware source compressor 306 and, for each GIS and receiver u, encodes the descriptions associated with the set P_(u) of entropy |P_(u)|B bits, into channel codewords

_(u)(P_(u)) of length n, via channel codebook

_(u), generated according to the definition where an (2^(nη) ^(u) ,n) channel code for the u-th binary channel consists of an index set {1, 2, . . . , 2^(nη) ^(u) }, and an encoding function

_(u):{1, 2, . . . , 2^(nη) ^(u) }→{0, 1}^(n), which yields the channel codebook {

_(u)(1), . . .

_(u)(2^(nη) ^(u) )}.

The decoding function being expressed as g_(u):Y^(n)→{1, 2, . . . , 2^(nη) ^(u) }. Note that if

$\frac{P_{u}}{\eta_{u}}B$ is not a multiple of n, then zero-padding may be applied to the |P_(u)|B bits.

The network element 151 notifies the computed codebooks to each receiver 200 at network setup or anytime channel conditions change. Hence, each receiver 200 is aware, not only of its own codebook, but also of the codebooks of the other receivers 200.

In order to ensure that receiver “u” obtains d_(u) descriptions at a channel rate η_(u)/ψ(f,M), the channel codeword length is set to

$n = \frac{\Delta}{\;{\psi\left( {f,M} \right)}}$ as noted above. As also noted above, the fact that n depends on the demand realization implies that the channel codebook may need to be updated and notified to each receiver 200 at each request round, which may lead to significant overhead. In order to eliminate or mitigate this overhead, the channel codeword length is set to

${n = \frac{\Delta}{\;{E\;\left\lbrack {\psi\left( {f,M} \right)} \right\rbrack}}},$ which, as noted earlier, is equivalent to set the time-slot duration to be equal to the video segment playback duration in average, and to set the average channel rate at which receiver “u” obtains d_(u) descriptions to η_(u)/E[ψ(f,M)].

The inner source encoder 310 generates the combined final multicast codeword X by XORing the channel codewords {

_(u)(P_(u))} belonging to the same GIS, and concatenating the resulting codewords of length n. Since the number of the GISs produced by the channel-aware source compressor 304 is given by χ_(CA), X is obtained by concatenating χ_(CA) codewords of length n, resulting in a multicast codeword of average length Δ.

Having described the operational steps above, two algorithmic embodiments of the channel-aware source compressor are described now. Each of the two embodiments build on generalizations of existing caching-aided coded multicast schemes to the case of noisy broadcast channels. Specifically, the first embodiment is referenced herein as the CA-CIC as the channel aware extension of the chromatic index coding scheme, and the second embodiment, referenced herein as the CA-HgC as the channel-aware extension of the polynomial-time hierarchical greedy coloring algorithm.

Channel-Aware Chromatic Index Coding (CA-CIC)

It is noted that finding a coded multicast scheme for the broadcast caching network is equivalent to finding an index code with side information given by the cache realization. A well-known index code is given by the chromatic number of the conflict graph, constructed according to the demand and cache realizations. Given the cache realization, a file-level demand realization (given by the request vector f) can be translated into a packet-level request vector containing the missing packets at each receiver. A request for file f_(u) by receiver u (step 402) may thus be considered equivalent to requesting D−|M_(u,f)| packets corresponding to all missing (i.e., uncached) packets of the highest quality level of video segment f_(u). However, based on the channel degradations, the sender schedules a subset of the missing packets d_(u)∈{1, . . . , D(1−M_(u,f))}, above (step 404). Denoting as W the scheduled random packet-level configuration and by W_(u,f) the set of packets of file f scheduled for receiver u, the corresponding index coding conflict graph

_(M,W)=(V,E) may be defined and constructed as where 1) Each vertex ν∈V represents a scheduled packet, uniquely identified by the pair {ρ(ν)μ(ν)}, where ρ(ν) indicates the packet identity associated to vertex ν and μ(ν) represents the receiver for whom it is scheduled. In total, we have |V|=Σ_(u∈)d_(u) vertices. And, 2) For any pair of vertices ν₁, ν₂, it can be understood that vertex ν₁ interferes with vertex ν₂ if the packet associated to the vertex ν₁, ρ(ν₁), is not in the cache of the receiver associated to vertex ν₂, μ(ν₂), and ρ(ν₁) and ρ(ν₂) do not represent the same packet. Then, there is an edge between ν₁ and ν₂ in E if ν₁ interferes with ν₂ or ν₂ interferes with ν₁.

In the constructed graph

_(M,W), the set of vertices scheduled for the same receiver, i.e., the set of vertices ν∈ such that μ(ν)=u, is fully-connected. Based on this consideration,

_(M,W) is referenced herein as a U-clustered graph.

Thus, in the present disclosure, the generalized independent sets determined in step 406 may be determined as (s₁, . . . , s_(U))-GIS from a U-clustered graph

_(M,W) as an ordered set of U fully connected sub-graphs {P₁, . . . P_(U)} such that for all u=1, . . . , U, and all ν∈P_(u), μ(ν)=u (i.e., all the packets in P_(u) are scheduled for receiver u); |P_(u)|=s_(u)≥0 (i.e., the number of packets in P_(u) is equal to s_(u)); and for all i≠u, P_(u) and P_(i) are mutually disconnected (i.e., no edges exist between any two subgraphs). Note that when s_(u)≤1, ∀u∈U, the generalized information set (s₁, . . . , s_(U))-GIS become the classical definition of independent set.

Based on the definition of the GIS above, a further definition of channel-aware valid coloring and channel-aware chromatic number of the conflict graph are introduced as follows. First, a (η₁, . . . , η_(U))-channel-aware valid vertex-coloring is obtained in step 406 by covering the conflict graph

_(M,W) with (s₁, . . . , s_(U))-GISs that further satisfy

${\frac{s_{u}}{s_{i}} = \frac{\eta_{u}}{\eta_{i}}},{\forall u},{i \in \left\{ {1,{\ldots\mspace{14mu} U}} \right\}},$ and assigning the same color to all the vertices in the same GIS, referenced herein as Channel-Aware Valid Vertex-Coloring.

Secondly, The (η₁, . . . , η_(U)) channel-aware chromatic number of a graph H is defined as

${\chi_{CA}\left( \mathcal{H}_{M,W} \right)} = {\min\limits_{c \in C}{\phi(c)}}$ where C denotes the set of all (η₁, . . . , η_(U)) channel-aware valid vertex-coloring of

_(M,W), and ϕ(c) is the total number of colors in

_(M,W) for the given (η₁, . . . , η_(U)) channel-aware valid vertex-coloring ϕ, referenced herein as the Channel-aware Chromatic Number.

It can thus be shown that for a given conflict graph

_(M,W) constructed according to cache realization, demand realization M, scheduled descriptions

$\left\{ {d_{u} = \frac{\Delta\;\eta_{u}}{B\;{\psi(,)}}} \right\},$ and scheduled random packet-level configuration W, a tight upper-bound for the the channel-aware chromatic number χ_(CA) (H_(M,W)), when the number of descriptions D→∞, is given by: χ_(CA)(H_(M,W))=ψ(f,M)+o(D).

Thus, the GISs associated to the chromatic number χ_(CA)(

_(M,W)) are then used by the concatenated source-channel encoder 306 to generate the final multicast codeword X (step 408).

As a concrete example, consider a network with U=3 receivers, denoted as U={1, 2, 3} and m=3 files denoted as F={

,

, C}. It is assumed that the channel rates are equal to η₁=½, η₂=¼, η₃=¼, and Δ=8 time-units. It is also assumed that demand and caching distributions are such that [ψ(,)]=2. Furthermore, as described above, each file is multiple description coded into D descriptions, e.g.,

={

₁,

₂, . . . ,

_(D)}, each of length B=F/D=1 bits.

In the example above, the sender is configured to schedules 2 descriptions for receiver 1, i.e., d₁=2, and one description for receivers 2 and 3, i.e., d₂=d₃=1. It may be assumed further that the caching realization is given by: M_(1,A)={

₁,

₂}, M_(1,C)={C₁}; M_(2,B)={

₁,

₂}, M_(2,C)={C₁}; M_(3,A)={

₁}, M_(3,B)={

₁,

₃}. Suppose that receiver 1 requests

, receiver 2 requests

and receiver 3 requests C such that M_(1,B)={

₁,

₂}, M_(2,A)={

₁} and M_(3,C)={C₁}. The corresponding U-clustered conflict graph H, that may be generated by the channel-aware source compressor 304 is is shown in FIG. 5, along with the U-clusters {_(u)}_(u=1) ³. Each vertex v in

_(M,W) illustrated in FIG. 5 is uniquely identified by the pair {ρ(ν), μ(ν)} with ρ(ν) indicating the packet identity and μ(ν) the requesting receiver.

Continuing the example, FIG. 6, illustrates (s₁, s₂, s₃)-GISs covering the 3-clustered graph

_(M,W). The first GIS is composed of two nonempty fully connected sub-graphs: P₁={ν₁, ν₂} with s₁=|P_(1|)=2, and P₂={ν₃} with s₂=|P₂|=1. The second GIS is composed of one non-empty fully connected subgraph: P₃={ν₄}, with s₃=|P₃|=1.

The channel-aware vertex coloring is also depicted in FIG. 6, with channel-aware chromatic number χ_(CA)(

_(M,W)) equal to two colors, one for each GIS (red dotted circle and black dotted circle). The multicast codeword of length Δ=8 is obtained concatenating the codewords

₁(P₁)⊕

₂(P₂) and

₃(P₃), each of length n=4.

Channel-Aware Hierarchical Greedy Coloring (CA-HgC)

In view of the exponential complexity of CA-CIC embodiment described above, an alternative embodiment referenced as Channel-Aware Hierarchical greedy Coloring (CA-HgC) is provided, which is a coded multicast algorithm that fully accounts for the broadcast channel impairments, while exhibiting polynomial-time complexity. The CA-HgC algorithm discussed below may be implemented in the channel-aware source compressor 304.

The CA-HgC algorithm works by computing two valid colorings of the conflict graph

_(M,W), referred to as CA-HgC₁ and CA-HgC₂. CA-HgC then compares the corresponding number of colors achieved by the two solutions and selects the coloring with minimum number of colors. It is noted that CA-HgC₁ coincides with the conventional naive (uncoded) multicast scheme. In fact, CA-HgC₁ computes the minimum coloring of

_(M,W) subject to the constraint that only the vertices representing the same packet are allowed to have the same color. In this case, the total number of colors is equal to the number of distinct requested packets, and the coloring can be found in O(|V|²). On the other hand, CA-HgC₂ is described by the algorithm illustrated in FIG. 7, in which the subroutine GISfunction (⋅,⋅,⋅) is defined by the algorithm illustrated in FIG. 8. It can be shown that the complexity of CA-HgC₂ is given by O(U|V|²), i.e., it is polynomial in |V|.

In the following, a walk-through of Algorithm of FIG. 7 is provided, followed by a concrete example. With a slight abuse of notation,

_(u)=

_(u)({ν′∈

:μ(ν′)=u}) denotes the codeword obtained by coding the Bs_(u) source bits associated to the packets {ρ(ν′):μ(ν′)=u}.

Let K_(ν)={u∈∪:ρ(ν)∈W_(u)∪M_(u)} denote the set of receivers that request and/or cache packet ρ(ν). The i-th vertex hierarchy of

_(M,W) is initialized to the set of vertices for whom the number of receivers requesting and/or caching its packet identity is equal to i, i.e.,

_(i)={ν:|K_(ν)|=i}. CA-HgC₂ proceeds in decreasing order of hierarchy starting from the U-th hierarchy.

The subroutine GISfunction (

_(i), ν,i) is called for each vertex ν in the i-th hierarchy in increasing order of cardinality |K_(ν)|. If the subroutine returns a non-empty set

, then the vertices in

are colored with the same color (lines 6-10). Otherwise, the uncolored vertex ν is moved to the next hierarchy, i.e.,

_(i-1) (lines 11-12). This procedure is iteratively applied for any hierarchy, until all the vertices in the conflict graph

_(M,W) are colored. The procedure returns the number of colors, |c|, as well as the set of codewords X.

Regarding the subroutine GISfunction (H_(i), ν,i) shown in FIG. 8, initially the set

={ν}. Then, for each vertex ν′∈

_(i) in increasing order of cardinality |K_(ν′)|, ν′ is moved into

if ν′ is not connected (via the conflict graph) to any node currently in

(lines 2-8). Note that in the first iteration the lowest cardinality in

_(i) is exactly equal to i. By construction, each vertex in the conflict graph has an associated receiver, hence Ω denotes the set of receivers associated to the vertices in

. If

<i, i.e., if at least i vertices were not selected, then the algorithm returns two empty sets (lines 23-25). Otherwise, the algorithm proceeds by trying to select, for each receiver μ(ν′)∈Ω, d_(μ(ν′))−1 additional lowest-cardinality vertices in

_(i) having no links with the vertices in

associated to receivers different from μ(ν′) (lines 10-17). If the algorithm succeeds (or if the considered hierarchy is 1, meaning that there are no further hierarchies to explore), then the algorithm returns the set of selected vertices

as well as the set of associated receivers Ω (lines 18-20). Otherwise, the algorithm returns two empty sets (lines 21-22).

As a concrete example, consider the same conflict graph

_(M,W) shown in FIG. 5, to which the algorithm of FIG. 7 is applied. The algorithm begins by constructing K_(ν) by inspection of the conflict graph: K_(ν) _(i) ={1, 2, 3}, K_(ν) ₂ ={1, 2}, K_(ν) ₃ ={1, 2, 3}, and K_(ν) ₄ ={1, 2, 3}. Hence

_(U)=

₃={ν₁, ν₃, ν₄},

₂={ν₂} and

₁=Ø. Starting from the highest hierarchy, in line 5 the subroutine GISfunction is called with parameters

₃, ν₁ and 3. By running iteratively the proposed algorithm, the GISs shown in FIG. 6 are obtained.

In this section, the decodability of the multicast codewords transmitted by the sender to the receivers is described. From the observation of its channel output Y_(u), representing its noisy version of the transmitted codeword X, each receiver is able to decode the d_(u) descriptions of its requested video segment, W_(u)∈

scheduled and transmitted by the sender as Ŵ_(u)=λ_(u)(Y_(u), Z_(u), f), via its own decoding function λ_(u), which consists of two stages.

First, the noisy version of the codeword

_(u)(j) is obtained by performing the inverse of the XOR-function. This processing can be conducted since, by design, the codewords of different receivers belonging to the same GISs do not interfere with each other (i.e., they can be generated from the cached information of receiver u). In fact, receiver u is informed by the sender of: i) all the U codebooks; ii) the packets from its cache that are present in the received XORed codeword, along with the corresponding codebooks used to construct the codeword.

Secondly, the recovered noisy codeword

_(u)(j) is sent to the channel decoder of receiver u, which reconstructs the bits associated to the set P_(u) according to the channel rate η_(u). Hence, in the limit D→∞, the proposed sequence of (Δ, {∈_(u)})-delivery schemes is admissible as defined below.

Each receiver u∈∪, after observing its channel output Y_(u), decodes the requested file W_(f) _(u) as Ŵ_(f) _(u) =λ_(u)(Y_(u), Z_(u), f), where λ_(u) denotes the decoding function of receiver u (with Y_(u) denoting the set of the received sequence at user u). The worst-case (over the library) probability of error of a (Δ, {∈_(u)})-delivery scheme over a stochastically degraded broadcast channel with channel degradations 0≤∈₁≤∈₂≤ . . . ≤∈_(U)≤1 is defined as

${P_{e}^{(F)}\left( {X,\left\{ Z_{u} \right\},\left\{ \lambda_{u} \right\},\left\{ ɛ_{u} \right\}} \right)} = {{\sup\limits_{\{ W_{f}\}}\left( {\bigcup\limits_{u \in U}\left\{ {{\hat{W}}_{f_{u}} \neq W_{f_{u}}} \right\}} \right)}.}$

Thus, a sequence of (Δ, {∈_(u)})-delivery schemes is called admissible if:

${\lim\limits_{F\rightarrow\infty}{P_{e}^{(F)}\left( {X,\left\{ Z_{u} \right\},\left\{ \lambda_{u} \right\},\left\{ ɛ_{u} \right\}} \right)}} = 0.$

It is noted that the variable-to-fixed nature of the multicast encoder is due to the fact that, while the length of the transmitted codeword X is fixed to the time-slot duration Δ, given by the video segment playback duration, the amount of information bits transmitted by the encoder is variable and given by Σ_(u)d_(u)B.

Although aspects herein have been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present disclosure. It is therefore to be understood that numerous modifications can be made to the illustrative embodiments and that other arrangements can be devised without departing from the spirit and scope of the disclosure. 

The invention claimed is:
 1. A network element for a wireless Content Delivery Network, comprising: a processor configured to: receive a request from receiver devices for a video segment over the wireless CDN; compute a number of descriptors of the video segment scheduled to be delivered to each of the receiver devices for the requested video segment, the number of descriptors being determined based on channel conditions between the network element and the each of the receiver devices and further based on video content previously cached at each of the receiver devices; cluster a set of descriptors for each of the receiver devices into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors, the channel conditions between the network element and each of the receiver devices, and the video content previously cached at each of the receiver devices; generate channel codewords encoding the clustered descriptors for each of the receiver devices using the minimum number of GISs and based on the channel conditions; generate a multicast codeword from the generated channel codewords for transmission to the receiver devices; and, transmit the multicast codeword to each of the receiver devices in response to the received request in order to allow each of the receiver devices to decode the multicast codeword into the requested video segment.
 2. The network element of claim 1, wherein the processor is further configured to: determine the clustered set of descriptors scheduled for each of the receiver devices and the minimum number of Generalized Independent Sets (GISs) based on cached content at each of the receiver devices.
 3. The network element of claim 1, wherein the processor is further configured to: generate the multicast codeword such that each of the receiver devices is enabled to decode its requested video segment at a rate that is equal to the maximum rate achievable based on the channel conditions.
 4. The network element of claim 3, wherein the processor is further configured to: generate the multicast codeword as a fixed length codeword.
 5. The network element of claim 3, wherein the processor is further configured to: cluster the set of descriptors scheduled for each of the receiver devices into a minimum number of Generalized Independent Sets (GISs) such that a plurality of scheduled descriptors in a GIS scheduled for different ones of the receiver devices can be transmitted in a same time-frequency slot without affecting decodability of the multicast codeword at the receiver devices.
 6. The network element of claim 1, wherein the processor is further configure to: determine the minimum number of Generalized Independent Sets (GIS s) as a determined channel-aware chromatic-number of GISs that cover a conflict graph.
 7. The network element of claim 1, wherein the processor if further configured to: encode the clustered descriptors scheduled for each of the receiver devices into fixed-length channel codewords for each of the receiver devices based on channel conditions between the network element and each of the receiver devices and to combine the fixed-length channel codewords into the multicast codeword.
 8. The network element of claim 7, wherein the processor is further configured to determine the fixed-length channel codewords for each of the receiver devices using a channel codebook that is determined based on the channel conditions between the network element and each of the receiver devices.
 9. The network element of claim 8, wherein the processor is further configured to: transmit the channel codebook to each of the receiver devices.
 10. The network element of claim 1, wherein the processor is further configured to: generate the multicast codeword encoding the clustered descriptors for each of the receiver devices using the minimum number of GISs and a Channel-Aware Chromatic Index Coding (CA-CIC) algorithm.
 11. The network element of claim 1, wherein the processor is further configured to: generate the multicast codeword encoding the clustered descriptors for each of the receiver devices using the minimum number of GISs and a Channel-Aware Hierarchical greedy Coloring (CA-HgC) algorithm.
 12. A computer-implemented method for transmitting data from a network element interconnected with a plurality of receiver devices via a wireless Content Delivery Network (CDN), the method comprising: receiving a request from the plurality of receiver devices for a data segment over the wireless CDN; computing a number of descriptors of the data segment scheduled to be delivered to each of the plurality of receiver devices for the requested data segment, the number of descriptors being determined for each of the plurality of receiver devices based on channel conditions between the network element and the plurality of receiver devices; cluster a set of descriptors for each of the plurality of receiver devices into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors and the channel conditions between the network element and each of the plurality of receiver devices; generate channel codewords encoding the clustered descriptors for each of the plurality of receiver devices using the minimum number of GISs and based on the channel conditions; generate a multicast codeword from the generated channel codewords for transmission to each of the plurality of receiver devices; and transmit the multicast codeword to each of the plurality of receiver devices in response to the received request in order to allow each of the plurality of receiver devices to decode the multicast codeword into the requested data segment.
 13. The computer-implemented method of claim 12, further comprising: determining the clustered set of descriptors scheduled for each of the plurality of receiver devices and the minimum number of Generalized Independent Sets (GIS s) based on cached content at each of the plurality of receiver devices.
 14. The computer-implemented method of claim 12, further comprising: generating the multicast codeword such that each of the plurality of receiver devices is enabled to decode its requested data segment at a rate that is equal to the maximum rate achievable based on the channel conditions.
 15. The computer-implemented method of claim 12, further comprising: clustering the set of descriptors scheduled for each of the plurality of receiver devices into a minimum number of Generalized Independent Sets (GISs) such that a plurality of scheduled descriptors in a GIS scheduled for different ones of the plurality of receiver devices can be transmitted in a same time-frequency slot without affecting decodability of the multicast codeword at the plurality of receiver devices.
 16. The computer-implemented method of claim 12, further comprising: determining the minimum number of Generalized Independent Sets (GISs) as a determined channel-aware chromatic-number of GISs that cover a conflict graph.
 17. The computer-implemented method of claim 12, further comprising: encoding the clustered descriptors scheduled for each of the plurality of receiver devices into fixed-length channel codewords for each of the plurality of receiver devices based on channel conditions between the network element and each of the plurality of receiver devices and combining the fixed-length channel codewords into the multicast codeword.
 18. The computer-implemented method of claim 17, further comprising: determining the fixed-length channel codewords for each of the plurality of receiver devices using a channel codebook that is determined based on the channel conditions between the network element and each of the plurality of receiver devices.
 19. The computer-implemented method of claim 12, further comprising: generating the multicast codeword encoding the clustered descriptors for each of the plurality of receiver devices using the minimum number of GISs and a Channel-Aware Chromatic Index Coding (CA-CIC) algorithm.
 20. The computer-implemented method of claim 12, further comprising: generating the multicast codeword encoding the clustered descriptors for each of the plurality of receiver devices using the minimum number of GISs and a Channel-Aware Hierarchical greedy Coloring (CA-HgC) algorithm. 